(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

f(X) → g

Rewrite Strategy: INNERMOST

(1) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)

Converted CpxTRS to CDT

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

f(z0) → g
Tuples:none
S tuples:none
K tuples:none
Defined Rule Symbols:

f

Defined Pair Symbols:none

Compound Symbols:none

(3) SIsEmptyProof (EQUIVALENT transformation)

The set S is empty

(4) BOUNDS(O(1), O(1))